Stochastic performance analysis of non-feedforward networks

نویسندگان

  • Chengzhi Li
  • Wei Zhao
چکیده

Many Internet applications are both delay and loss sensitive, and need network performance guarantees that include bandwidth, delay/delay jitter, and packet loss rate. It is very important to quantify and exploit the capabilities of guaranteed service provisioning of communication networks. In this paper, we study the queueing behaviors of non-feedforward networks (a non-feedforward network is a network in which at least one set of acyclic traffic routes forms a cycle; a feedforward network is a network in which any set of acyclic traffic routes does not form a cycle) with FIFO scheduling discipline and Regulated, Markov On-Off, and Fractional Brownian traffic sources. We develop a new methodology to analyze the probabilistic bounds on the delays experienced by traffic. By leveraging the large deviations and fixed-point techniques, we turn probability problems into deterministic optimization problems and translate a probabilistic delay bound into a fixed point of a non-linear real function. Our contribution in this paper is the derivation of a probabilistic bound on the delays experienced by traffic in non-feedforward networks, based on an assumption, i.e., the tail probability of the difference between the beginning time of a busy interval of a server and the earliest arriving time at the corresponding network ingress of the traffic arrivals that arrive at this server during this busy interval can be bounded by the maximum of the violation probabilities of the accumulative upper stream delay bound suffered by this server‘s traffic arrivals. Consequently, our new results C. Li ( ) University of Houston, Houston, TX, USA e-mail: [email protected] W. Zhao University of Macau, Macau, China e-mail: [email protected] not only consummate the theory of stochastic analysis of network performance, but also facilitate the design of protocols and algorithms for non-feedforward networks to provide performance guarantees to various applications with diverse performance requirements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Overlapping Community Detection in Social Networks Based on Stochastic Simulation

Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...

متن کامل

Modeling and Performance Evaluation of Energy Consumption in S-MAC Protocol Using Generalized Stochastic Petri Nets

One of the features of wireless sensor networks is that the nodes in this network have limited power sources. Therefore, assessment of energy consumption in these networks is very important. What has been common practice has been the use of traditional simulators to evaluate the energy consumption of the nodes in these networks. Simulators often have problems such as fluctuating output values i...

متن کامل

بررسی کارایی روش‌های مختلف هوش مصنوعی و روش آماری در برآورد میزان رواناب (مطالعه موردی: حوزه شهید نوری کاخک گناباد)

Rainfall-runoff models are used in the field of hydrology and runoff estimation for many years, but despite existing numerous models, the regular release of new models shows that there is still not a model that can provide sophisticated estimations with high accuracy and performance. In order to achieve the best results, modeling and identification of factors affecting the output of the model i...

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

Learning Stochastic Feedforward Neural Networks

Multilayer perceptrons (MLPs) or neural networks are popular models used for nonlinear regression and classification tasks. As regressors, MLPs model the conditional distribution of the predictor variables Y given the input variables X . However, this predictive distribution is assumed to be unimodal (e.g. Gaussian). For tasks involving structured prediction, the conditional distribution should...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Telecommunication Systems

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2010